A Hybrid Particle Swarm Optimization Algorithm for Service Selection Problem in the Cloud
نویسندگان
چکیده
With the growing number of alternative services in the cloud environment, users have put forward new requirements to solve the service dynamic selection problem quickly and efficiently. In this paper, an evaluation model of service process which considers concurrent requests and service association is proposed. This model evaluates the service process from three dimensions which are functional quality dimension, non-functional quality dimension and transactional dimension. To solve the service selection problem efficiently, we first design a novel coding strategy of particle, and then propose an approach based on hybrid particle swarm optimization algorithm which combines the crossover and mutation operators of genetic algorithm. The experimental results show that our proposed approach is feasible and effective.
منابع مشابه
Integrated modeling and solving the resource allocation problem and task scheduling in the cloud computing environment
Cloud computing is considered to be a new service provider technology for users and businesses. However, the cloud environment is facing a number of challenges. Resource allocation in a way that is optimum for users and cloud providers is difficult because of lack of data sharing between them. On the other hand, job scheduling is a basic issue and at the same time a big challenge in reaching hi...
متن کاملDiversified Particle Swarm Optimization for Hybrid Flowshop Scheduling
The aim of this paper is to propose a new particle swarm optimization algorithm to solve a hybrid flowshop scheduling with sequence-dependent setup times problem, which is of great importance in the industrial context. This algorithm is called diversified particle swarm optimization algorithm which is a generalization of particle swarm optimization algorithm and inspired by an anarchic society ...
متن کاملA Novel Hybrid Modified Binary Particle Swarm Optimization Algorithm for the Uncertain p-Median Location Problem
Here, we investigate the classical p-median location problem on a network in which the vertex weights and the distances between vertices are uncertain. We propose a programming model for the uncertain p-median location problem with tail value at risk objective. Then, we show that it is NP-hard. Therefore, a novel hybrid modified binary particle swarm optimization algorithm is presented to obtai...
متن کاملComparison of particle swarm optimization and tabu search algorithms for portfolio selection problem
Using Metaheuristics models and Evolutionary Algorithms for solving portfolio problem has been considered in recent years.In this study, by using particles swarm optimization and tabu search algorithms we optimized two-sided risk measures . A standard exact penalty function transforms the considered portfolio selection problem into an equivalent unconstrained minimization problem. And in final...
متن کاملStock Price Prediction using Machine Learning and Swarm Intelligence
Background and Objectives: Stock price prediction has become one of the interesting and also challenging topics for researchers in the past few years. Due to the non-linear nature of the time-series data of the stock prices, mathematical modeling approaches usually fail to yield acceptable results. Therefore, machine learning methods can be a promising solution to this problem. Methods: In this...
متن کامل